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 listOct 25, 2026 11:54timothygktimothygkScore: 8,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 11:598,33780,159,70458,763,00010,442,0002,117,632stderr
2Oct 25, 2026 11:598,33981,075,52358,737,00010,477,0002,117,632stderr
3Oct 25, 2026 11:598,42281,853,63259,443,00010,466,0002,117,632stderr
4Oct 25, 2026 11:598,52083,053,41859,623,00011,098,0002,117,632stderr
5Oct 25, 2026 11:598,54082,346,34259,761,00011,122,0002,117,632stderr
6Oct 25, 2026 11:598,54382,443,20759,724,00011,188,0002,117,632stderr
7Oct 25, 2026 11:598,54482,403,57959,942,00010,975,0002,117,632stderr
8Oct 25, 2026 11:598,55282,432,55059,899,00011,085,0002,117,632stderr
9Oct 25, 2026 11:598,64383,181,94560,830,00010,908,0002,117,632stderr