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 30, 2026 21:09Josu San MartinJosu San MartinScore: 4,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:104,33144,477,54434,917,0001,031,0002,113,536
2Aug 30, 2026 21:104,33644,454,47634,965,0001,030,0002,113,536
3Aug 30, 2026 21:104,34144,526,76934,987,0001,047,0002,113,536
4Aug 30, 2026 21:104,34244,525,15535,001,0001,042,0002,113,536
5Aug 30, 2026 21:104,34344,504,43035,014,0001,036,0002,113,536
6Aug 30, 2026 21:104,34844,595,38235,059,0001,031,0002,113,536
7Aug 30, 2026 21:104,35344,639,96835,095,0001,035,0002,113,536
8Aug 30, 2026 21:104,36244,704,14835,178,0001,028,0002,113,536
9Aug 30, 2026 21:104,36444,573,94835,189,0001,034,0002,113,536