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 listJul 7, 2026 10:54Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:55037,959,35827,438,0001,061,0002,117,632expected "53692679619828794 ", got "16056219840429107"
2Jul 7, 2026 10:55038,116,52527,524,0001,069,0002,117,632expected "53685131392373504 ", got "3978145452431913988"
3Jul 7, 2026 10:55038,074,54127,470,0001,063,0002,117,632expected "53684045532572218 ", got "3965987976118471988"