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 21, 2026 16:32Victor MerckléVictor MerckléScore: 4,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 16:334,58046,020,78736,944,0001,078,0002,113,536
2May 21, 2026 16:334,58945,942,99337,010,0001,082,0002,113,536
3May 21, 2026 16:334,60046,223,76837,151,0001,034,0002,113,536
4May 21, 2026 16:334,61146,095,53937,271,0001,001,0002,113,536
5May 21, 2026 16:334,61846,212,10937,303,0001,032,0002,113,536
6May 21, 2026 16:334,62053,511,85237,298,0001,050,0002,113,536
7May 21, 2026 16:334,62348,647,73837,309,0001,066,0002,113,536
8May 21, 2026 16:334,67846,658,19437,808,0001,023,0002,113,536
9May 21, 2026 16:334,81348,409,66238,872,0001,081,0002,113,536