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 14, 2026 10:39wnwnScore: 4,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 10:394,03353,346,59032,462,0001,014,0002,494,464
2Apr 14, 2026 10:384,05356,094,82332,622,0001,019,0002,502,656
3Apr 14, 2026 10:384,07559,933,35831,837,0001,989,0002,531,328
4Apr 14, 2026 10:394,10458,737,09132,062,0002,003,0002,486,272
5Apr 14, 2026 10:394,16059,497,65633,512,0001,015,0002,490,368
6Apr 14, 2026 10:384,21460,109,94532,979,0001,998,0002,486,272