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 13, 2026 02:33Victor MerckléVictor MerckléScore: 9,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 02:339,32887,015,46876,416,0001,013,0002,113,536
2May 13, 2026 02:339,32986,140,61376,432,0001,006,0002,113,536
3May 13, 2026 02:339,33086,739,54676,425,0001,015,0002,113,536
4May 13, 2026 02:339,33185,498,70176,439,0001,009,0002,113,536
5May 13, 2026 02:339,33187,854,32776,446,0001,005,0002,113,536
6May 13, 2026 02:339,33387,259,33076,459,0001,005,0002,113,536
7May 13, 2026 02:339,33487,044,57776,430,0001,043,0002,113,536
8May 13, 2026 02:339,33584,740,40676,459,0001,022,0002,113,536
9May 13, 2026 02:339,44586,684,87277,352,0001,047,0002,113,536