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 8, 2026 11:30Alexander StanovoyAlexander StanovoyScore: 39,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:3038,811331,774,229320,948,0001,187,0002,113,536
2Jul 8, 2026 11:3038,814332,356,348321,158,0001,002,0002,113,536
3Jul 8, 2026 11:3038,904332,881,106321,858,0001,050,0002,113,536
4Jul 8, 2026 11:3039,192334,988,789324,255,0001,043,0002,113,536
5Jul 8, 2026 11:3039,523337,718,047326,848,0001,200,0002,113,536
6Jul 8, 2026 11:3039,531338,398,865327,111,0001,002,0002,113,536
7Jul 8, 2026 11:3040,076342,313,088331,635,0001,002,0002,113,536
8Jul 8, 2026 11:3040,403345,069,611334,157,0001,188,0002,113,536
9Jul 8, 2026 11:3040,412345,025,868334,232,0001,192,0002,113,536