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 listApr 24, 2026 14:27TudyMTudyMScore: 49,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:2749,709426,763,419410,592,0001,998,0002,363,392
2Apr 24, 2026 14:2749,713430,570,887410,624,0001,998,0002,363,392
3Apr 24, 2026 14:2749,718430,259,495410,666,0001,998,0002,367,488
4Apr 24, 2026 14:2749,724433,380,025410,716,0001,998,0002,301,952
5Apr 24, 2026 14:2749,726436,056,601410,736,0001,998,0002,379,776
6Apr 24, 2026 14:2749,726428,033,225410,734,0001,998,0002,371,584
7Apr 24, 2026 14:2749,733426,911,703409,790,0002,998,0002,359,296
8Apr 24, 2026 14:2749,749432,031,722410,924,0001,999,0002,301,952
9Apr 24, 2026 14:2749,753426,472,314409,951,0002,999,0002,555,904