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 20:13Josu San MartinJosu San MartinScore: 4,299Success
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 20:164,29344,056,16434,594,0001,040,0002,113,536
2Aug 30, 2026 20:164,29544,039,30934,606,0001,050,0002,113,536
3Aug 30, 2026 20:164,29844,085,01534,626,0001,054,0002,113,536
4Aug 30, 2026 20:164,29944,115,14434,633,0001,051,0002,113,536
5Aug 30, 2026 20:164,29944,148,49534,636,0001,049,0002,113,536
6Aug 30, 2026 20:164,32144,294,78134,834,0001,033,0002,113,536
7Aug 30, 2026 20:164,34944,492,50535,072,0001,026,0002,113,536
8Aug 30, 2026 20:164,37968,334,06835,229,0001,119,0002,113,536
9Aug 30, 2026 20:164,38459,560,59235,282,0001,109,0002,113,536