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 listMar 31, 2026 22:35zielajzielajScore: 3,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 22:483,44150,435,50727,538,0001,019,0002,433,024
2Mar 31, 2026 22:353,44454,071,77327,566,0001,020,0002,478,080
3Mar 31, 2026 22:353,44651,743,90427,583,0001,021,0002,437,120
4Mar 31, 2026 22:483,44653,958,59027,580,0001,021,0002,428,928
5Mar 31, 2026 22:353,45650,312,20427,661,0001,024,0002,523,136
6Mar 31, 2026 22:483,47550,765,49226,851,0001,988,0002,482,176