Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 22, 2026 09:48lipapipalipapipaScore: 40,970Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 09:4840,885366,696,626338,341,0001,001,0002,387,968
2Jan 22, 2026 09:4840,945372,129,896337,841,0001,999,0002,396,160
3Jan 22, 2026 09:4840,952368,888,823337,905,0001,999,0002,392,064
4Jan 22, 2026 09:4840,964365,737,308339,002,0001,000,0002,269,184
5Jan 22, 2026 09:4840,970366,910,630337,055,0003,000,0002,269,184
6Jan 22, 2026 09:4840,986365,408,098339,182,0001,000,0002,396,160
7Jan 22, 2026 09:4840,988362,803,358339,201,0001,000,0002,269,184
8Jan 22, 2026 09:4841,000365,161,145339,298,0001,000,0002,473,984
9Jan 22, 2026 09:4841,049372,642,264339,707,000999,0002,273,280