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 listAug 1, 2026 15:00George SeabridgeGeorge SeabridgeScore: 8,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 15:006,89267,423,91556,118,0001,086,0002,113,536
2Aug 1, 2026 15:006,90367,254,37956,222,0001,081,0002,113,536
3Aug 1, 2026 15:008,11778,264,09366,158,0001,214,0002,113,536
4Aug 1, 2026 15:008,13177,510,98366,398,0001,091,0002,113,536
5Aug 1, 2026 15:008,13477,571,13666,427,0001,092,0002,113,536
6Aug 1, 2026 15:008,13977,541,59466,448,0001,109,0002,113,536
7Aug 1, 2026 15:008,13977,604,12566,465,0001,096,0002,113,536
8Aug 1, 2026 15:008,14377,574,55566,499,0001,095,0002,113,536
9Aug 1, 2026 15:008,16479,032,09666,659,0001,104,0002,113,536