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 14:50Alexander StanovoyAlexander StanovoyScore: 73,810Success
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 14:5072,195608,946,456598,037,0001,185,0002,113,536
2Jul 8, 2026 14:5073,134618,183,483605,951,0001,063,0002,113,536
3Jul 8, 2026 14:5073,724621,599,410610,911,0001,002,0002,113,536
4Jul 8, 2026 14:5073,801622,777,266611,544,0001,010,0002,113,536
5Jul 8, 2026 14:5073,810622,349,003611,601,0001,026,0002,113,536
6Jul 8, 2026 14:5074,010624,092,409613,287,0001,001,0002,113,536
7Jul 8, 2026 14:5074,176625,423,244614,466,0001,199,0002,113,536
8Jul 8, 2026 14:5074,472628,090,493617,107,0001,017,0002,113,536
9Jul 8, 2026 14:5074,479628,472,994617,179,0001,003,0002,113,536