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 27, 2026 08:12Victor MerckléVictor MerckléScore: 4,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 08:133,98641,455,45031,954,0001,136,0002,113,536
2Aug 27, 2026 08:133,99441,557,03132,017,0001,137,0002,113,536
3Aug 27, 2026 08:134,01041,768,77332,265,0001,018,0002,113,536
4Aug 27, 2026 08:134,01141,677,43132,142,0001,156,0002,113,536
5Aug 27, 2026 08:134,02441,846,80032,194,0001,211,0002,113,536
6Aug 27, 2026 08:134,02741,818,70332,294,0001,134,0002,113,536
7Aug 27, 2026 08:134,03441,842,28632,320,0001,169,0002,113,536
8Aug 27, 2026 08:134,28743,982,48734,529,0001,057,0002,113,536
9Aug 27, 2026 08:134,30044,103,38534,600,0001,092,0002,113,536