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 30, 2026 19:43Josu San MartinJosu San MartinScore: 4,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:434,30147,711,29034,640,0001,066,0002,113,536
2Aug 30, 2026 19:434,30344,208,43734,672,0001,051,0002,113,536
3Aug 30, 2026 19:434,31144,225,82934,742,0001,043,0002,113,536
4Aug 30, 2026 19:434,31144,292,92734,754,0001,035,0002,113,536
5Aug 30, 2026 19:434,31944,281,97034,725,0001,123,0002,113,536
6Aug 30, 2026 19:434,31944,266,78234,736,0001,114,0002,113,536
7Aug 30, 2026 19:434,32344,347,37134,834,0001,051,0002,113,536
8Aug 30, 2026 19:434,32844,436,61134,907,0001,017,0002,113,536
9Aug 30, 2026 19:434,32944,364,10434,865,0001,070,0002,113,536