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 19, 2026 17:33Adam FolwarcznyAdam FolwarcznyScore: 13,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:3313,007117,752,087106,779,0001,180,0002,113,536
2Jul 19, 2026 17:3313,017117,820,609106,862,0001,184,0002,113,536
3Jul 19, 2026 17:3313,022118,542,559106,815,0001,271,0002,113,536
4Jul 19, 2026 17:3313,025118,519,944106,835,0001,276,0002,113,536
5Jul 19, 2026 17:3313,026118,516,861106,849,0001,272,0002,113,536
6Jul 19, 2026 17:3313,030117,873,547107,125,0001,024,0002,113,536
7Jul 19, 2026 17:3313,047120,054,503107,287,0001,009,0002,113,536
8Jul 19, 2026 17:3313,076118,977,801107,270,0001,267,0002,113,536
9Jul 19, 2026 17:3313,120120,025,242107,894,0001,007,0002,113,536