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 listAug 27, 2026 16:50Victor MerckléVictor MerckléScore: 4,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:504,77247,894,81536,858,0002,753,0002,113,536
2Aug 27, 2026 16:504,82949,107,37038,011,0002,076,0002,113,536
3Aug 27, 2026 16:504,88249,601,96738,467,0002,055,0002,113,536
4Aug 27, 2026 16:504,89648,940,26838,011,0002,630,0002,113,536
5Aug 27, 2026 16:504,95049,412,55838,320,0002,767,0002,113,536
6Aug 27, 2026 16:504,99049,766,62838,662,0002,757,0002,113,536
7Aug 27, 2026 16:505,03050,809,15239,029,0002,725,0002,113,536
8Aug 27, 2026 16:505,03250,751,06639,061,0002,706,0002,113,536
9Aug 27, 2026 16:505,06451,531,59539,401,0002,638,0002,113,536