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 31, 2026 12:39George SeabridgeGeorge SeabridgeScore: 69,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 12:4068,949582,267,631571,144,0001,135,0002,117,632
2Jul 31, 2026 12:4069,246584,709,015573,554,0001,193,0002,117,632
3Jul 31, 2026 12:4069,637587,909,238576,853,0001,137,0002,117,632
4Jul 31, 2026 12:4069,686588,391,627577,261,0001,133,0002,117,632
5Jul 31, 2026 12:4069,694588,451,403577,276,0001,188,0002,117,632
6Jul 31, 2026 12:4069,729588,716,460577,611,0001,146,0002,117,632
7Jul 31, 2026 12:4069,834589,823,222578,443,0001,182,0002,117,632
8Jul 31, 2026 12:4069,844589,662,542578,572,0001,137,0002,117,632
9Jul 31, 2026 12:4069,899590,164,458579,027,0001,138,0002,117,632