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 06:54Victor MerckléVictor MerckléScore: 4,081Success
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 06:544,04441,917,55432,496,0001,075,0002,113,536
2Aug 27, 2026 06:544,05241,792,99732,498,0001,141,0002,113,536
3Aug 27, 2026 06:544,05541,823,21032,583,0001,076,0002,113,536
4Aug 27, 2026 06:544,05642,780,67732,495,0001,171,0002,113,536
5Aug 27, 2026 06:544,08142,382,25432,768,0001,107,0002,113,536
6Aug 27, 2026 06:544,12042,539,95133,067,0001,131,0002,113,536
7Aug 27, 2026 06:544,14642,834,17033,263,0001,155,0002,113,536
8Aug 27, 2026 06:544,18643,132,02633,581,0001,166,0002,113,536
9Aug 27, 2026 06:544,30744,099,25634,692,0001,057,0002,113,536