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 listApr 19, 2026 09:33wnwnScore: 4,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 09:344,07761,156,42231,849,0001,990,0002,531,328
2Apr 19, 2026 09:344,07961,655,77832,859,000995,0002,490,368
3Apr 19, 2026 09:334,09057,813,57931,954,0001,997,0002,277,376
4Apr 19, 2026 09:334,10153,484,61432,034,0002,002,0002,494,464
5Apr 19, 2026 09:344,12456,896,31932,214,0002,013,0002,277,376
6Apr 19, 2026 09:334,14058,374,74433,350,0001,010,0002,277,376