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 26, 2026 22:34Victor MerckléVictor MerckléScore: 4,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:354,08342,346,13532,890,0001,007,0002,117,632stderr
2Aug 26, 2026 22:354,09343,017,20232,961,0001,018,0002,117,632stderr
3Aug 26, 2026 22:354,09542,358,12332,968,0001,024,0002,117,632stderr
4Aug 26, 2026 22:354,09842,525,31232,916,0001,101,0002,117,632stderr
5Aug 26, 2026 22:354,10642,479,23233,077,0001,010,0002,117,632stderr
6Aug 26, 2026 22:354,12242,610,16333,139,0001,079,0002,117,632stderr
7Aug 26, 2026 22:354,13642,775,26933,322,0001,013,0002,117,632stderr
8Aug 26, 2026 22:354,14043,001,93433,357,0001,007,0002,117,632stderr
9Aug 26, 2026 22:354,23143,546,23434,101,0001,022,0002,117,632stderr