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 listJul 9, 2026 19:34Victor MerckléVictor MerckléScore: 13,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 19:3613,795122,384,300113,395,0001,104,0002,117,632stderr
2Jul 9, 2026 19:3613,810122,452,565113,488,0001,141,0002,117,632stderr
3Jul 9, 2026 19:3613,820122,570,755113,568,0001,142,0002,117,632stderr
4Jul 9, 2026 19:3613,856122,867,688113,895,0001,117,0002,117,632stderr
5Jul 9, 2026 19:3613,867123,004,208114,079,0001,023,0002,117,632stderr
6Jul 9, 2026 19:3613,869123,044,356114,089,0001,024,0002,117,632stderr
7Jul 9, 2026 19:3613,913123,391,107114,378,0001,104,0002,117,632stderr
8Jul 9, 2026 19:3613,914125,023,702114,455,0001,032,0002,117,632stderr
9Jul 9, 2026 19:3613,985124,157,175115,045,0001,032,0002,117,632stderr