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 23:07Victor MerckléVictor MerckléScore: 7,589Success
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 23:077,58172,329,49362,930,00002,113,536
2May 13, 2026 23:077,58272,164,16762,931,00002,113,536
3May 13, 2026 23:077,58372,095,50262,943,00002,113,536
4May 13, 2026 23:077,58670,229,12862,965,00002,113,536
5May 13, 2026 23:077,58972,437,84061,985,0001,007,0002,113,536
6May 13, 2026 23:077,59570,962,57362,023,0001,018,0002,113,536
7May 13, 2026 23:077,59773,160,74162,008,0001,049,0002,113,536
8May 13, 2026 23:077,60572,804,60962,005,0001,124,0002,113,536
9May 13, 2026 23:077,69571,136,33062,857,0001,012,0002,113,536