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 listMay 22, 2026 08:15Victor MerckléVictor MerckléScore: 13,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:1613,511121,064,631111,078,0001,064,0002,113,536
2May 22, 2026 08:1613,513121,517,069111,076,0001,082,0002,113,536
3May 22, 2026 08:1613,518122,470,545111,131,0001,072,0002,113,536
4May 22, 2026 08:1613,528121,570,095111,256,0001,033,0002,113,536
5May 22, 2026 08:1613,530120,136,082111,264,0001,035,0002,113,536
6May 22, 2026 08:1613,538121,170,755111,344,0001,027,0002,113,536
7May 22, 2026 08:1613,541120,242,980111,359,0001,033,0002,113,536
8May 22, 2026 08:1613,549122,335,081111,430,0001,028,0002,113,536
9May 22, 2026 08:1613,551123,311,571111,472,0001,002,0002,113,536