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 23, 2026 04:20timothygktimothygkScore: 13,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2026 04:2013,510122,964,76891,036,00021,103,0002,117,632stderr
2Oct 23, 2026 04:2013,527123,220,78391,282,00021,000,0002,117,632stderr
3Oct 23, 2026 04:2013,555123,454,66491,032,00021,476,0002,117,632stderr
4Oct 23, 2026 04:2013,573123,569,89591,224,00021,435,0002,117,632stderr
5Oct 23, 2026 04:2013,578123,586,56191,888,00020,817,0002,117,632stderr
6Oct 23, 2026 04:2013,630124,109,71591,443,00021,686,0002,117,632stderr
7Oct 23, 2026 04:2013,664124,451,86592,315,00021,103,0002,117,632stderr
8Oct 23, 2026 04:2013,668124,836,81191,795,00021,650,0002,117,632stderr
9Oct 23, 2026 04:2013,706125,130,03391,928,00021,836,0002,117,632stderr