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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 23:274,18443,326,24730,602,0004,132,00024,576stderr
2Sep 7, 2026 23:274,20944,097,22930,866,0004,075,00024,576stderr
3Sep 7, 2026 23:274,23043,387,22130,452,0004,658,0002,117,632stderr
4Sep 7, 2026 23:274,23543,521,30430,635,0004,520,00024,576stderr
5Sep 7, 2026 23:274,23743,574,05230,556,0004,615,00024,576stderr
6Sep 7, 2026 23:274,24044,468,93930,674,0004,521,0002,117,632stderr
7Sep 7, 2026 23:274,27744,726,50130,564,0004,937,0002,117,632stderr
8Sep 7, 2026 23:274,27843,771,45230,761,0004,748,0002,117,632stderr
9Sep 7, 2026 23:274,34544,591,35130,770,0005,299,0002,117,632stderr