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 8, 2026 22:36wnwnScore: 4,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 22:364,39161,116,07435,437,0001,012,0002,490,368
2Mar 8, 2026 22:364,41963,103,88635,663,0001,018,0002,490,368
3Mar 8, 2026 22:364,43565,684,34634,822,0001,989,0002,273,280
4Mar 8, 2026 22:374,43960,010,44534,851,0001,991,0002,273,280
5Mar 8, 2026 22:374,45957,664,24035,008,0002,000,0002,273,280
6Mar 8, 2026 22:374,46162,312,50135,023,0002,001,0002,494,464