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 15, 2026 15:52timothygktimothygkScore: 34,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 15:5834,474297,458,204284,939,0001,196,0002,117,632stderr
2Oct 15, 2026 15:5834,477296,579,611284,968,0001,193,0002,117,632stderr
3Oct 15, 2026 15:5834,492296,658,879285,075,0001,216,0002,117,632stderr
4Oct 15, 2026 15:5834,497296,890,208285,098,0001,229,0002,117,632stderr
5Oct 15, 2026 15:5834,544297,190,533285,504,0001,212,0002,117,632stderr
6Oct 15, 2026 15:5835,234303,019,322291,442,0001,002,0002,117,632stderr
7Oct 15, 2026 15:5835,255303,019,719291,391,0001,230,0002,117,632stderr
8Oct 15, 2026 15:5835,589306,517,365294,184,0001,208,0002,117,632stderr
9Oct 15, 2026 15:5835,606306,009,998294,324,0001,210,0002,117,632stderr