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:15George SeabridgeGeorge SeabridgeScore: 50,734Success
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:1644,133376,255,776365,217,0001,088,0002,113,536
2Aug 1, 2026 15:1644,539379,556,056368,595,0001,082,0002,113,536
3Aug 1, 2026 15:1644,896382,671,302371,564,0001,081,0002,113,536
4Aug 1, 2026 15:1645,592388,653,337377,309,0001,111,0002,113,536
5Aug 1, 2026 15:1650,734431,079,572419,908,0001,187,0002,113,536
6Aug 1, 2026 15:1651,049433,714,277422,609,0001,099,0002,113,536
7Aug 1, 2026 15:1651,252436,150,892424,298,0001,097,0002,113,536
8Aug 1, 2026 15:1652,587446,641,309435,373,0001,106,0002,113,536
9Aug 1, 2026 15:1657,562487,754,009476,679,0001,092,0002,113,536