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 listFeb 15, 2026 23:19wnwnScore: 8,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:197,17383,467,52954,489,0005,045,0002,269,184
2Feb 15, 2026 23:197,21883,150,04151,920,0007,987,0002,437,120
3Feb 15, 2026 23:197,29691,703,62651,474,0009,083,0002,437,120
4Feb 15, 2026 23:198,40896,092,87159,814,0009,969,0002,359,296
5Feb 15, 2026 23:198,45894,725,94661,179,0009,026,0002,441,216
6Feb 15, 2026 23:198,49398,115,83662,439,0008,056,0002,465,792