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 23, 2026 23:25Victor MerckléVictor MerckléScore: 4,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 23:264,68646,982,81837,842,0001,060,0002,113,536
2May 23, 2026 23:264,69247,199,75437,889,0001,060,0002,113,536
3May 23, 2026 23:264,69648,543,60837,903,0001,077,0002,113,536
4May 23, 2026 23:264,70848,906,11237,997,0001,081,0002,113,536
5May 23, 2026 23:264,70947,488,86938,023,0001,068,0002,113,536
6May 23, 2026 23:264,71048,176,21538,083,0001,010,0002,113,536
7May 23, 2026 23:264,71647,544,97038,079,0001,072,0002,113,536
8May 23, 2026 23:264,72249,091,76938,103,0001,090,0002,113,536
9May 23, 2026 23:264,72347,660,63138,139,0001,070,0002,113,536