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 listFeb 6, 2026 09:59Daniel MastalerzDaniel MastalerzScore: 58,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 09:5958,530511,018,867483,804,0001,999,0002,269,184
2Feb 6, 2026 09:5958,750515,427,336484,631,0002,997,0002,269,184
3Feb 6, 2026 09:5958,801510,704,674485,049,0003,000,0002,277,376