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 listSep 17, 2026 00:19Andrew EpsteinAndrew EpsteinScore: 3,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:203,94142,849,60829,306,0003,408,0002,121,728stderr
2Sep 17, 2026 00:203,94342,985,54529,320,0003,412,0002,121,728stderr
3Sep 17, 2026 00:203,94642,930,72429,343,0003,417,0002,121,728stderr
4Sep 17, 2026 00:203,94842,923,44929,370,0003,401,0002,121,728stderr
5Sep 17, 2026 00:203,95544,211,87029,426,0003,404,0002,121,728stderr
6Sep 17, 2026 00:203,96142,994,16329,506,0003,372,0002,121,728stderr
7Sep 17, 2026 00:203,96642,989,84429,561,0003,357,0002,121,728stderr
8Sep 17, 2026 00:203,97443,302,47729,573,0003,413,0002,121,728stderr
9Sep 17, 2026 00:203,98543,239,99129,665,0003,417,0002,121,728stderr