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 1, 2026 18:27TragmatiSTragmatiSScore: 396,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 18:27391,4323,258,746,4023,179,621,00069,267,0002,113,536
2Jul 1, 2026 18:27396,9123,304,030,4223,223,295,00071,082,0002,113,536
3Jul 1, 2026 18:27403,5113,358,748,4613,279,913,00069,229,0002,113,536