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 1, 2026 10:33Victor MerckléVictor MerckléScore: 4,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:334,35344,574,75435,018,0001,116,0002,117,632stderr
2Aug 1, 2026 10:334,36744,797,30835,128,0001,124,0002,117,632stderr
3Aug 1, 2026 10:334,37244,751,72935,182,0001,107,0002,117,632stderr
4Aug 1, 2026 10:334,37944,832,49835,244,0001,103,0002,117,632stderr
5Aug 1, 2026 10:334,38144,844,18635,258,0001,112,0002,117,632stderr
6Aug 1, 2026 10:334,38744,838,20435,391,0001,023,0002,117,632stderr
7Aug 1, 2026 10:334,38944,923,34235,415,0001,021,0002,117,632stderr
8Aug 1, 2026 10:334,39344,902,84035,358,0001,111,0002,117,632stderr
9Aug 1, 2026 10:334,40545,012,35435,539,0001,026,0002,117,632stderr