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 15, 2026 00:26boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 00:270127,305,479115,905,0001,102,0002,113,536expected "53685567710328395 ", got "0 53685567710328395 "
2Jul 15, 2026 00:270121,120,141110,326,0001,047,0002,113,536expected "53692745613457261 ", got "0 53692745613457261 "
3Jul 15, 2026 00:270123,272,136111,877,0001,054,0002,113,536expected "53691158184215914 ", got "0 53691158184215914 "