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 listJun 20, 2026 09:56Victor MerckléVictor MerckléScore: 14,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 09:5714,159125,134,459116,498,0001,023,0002,113,536
2Jun 20, 2026 09:5714,234125,770,842117,071,0001,079,0002,113,536
3Jun 20, 2026 09:5714,235125,825,441117,129,0001,027,0002,113,536
4Jun 20, 2026 09:5714,235125,834,098116,874,0001,280,0002,113,536
5Jun 20, 2026 09:5714,244125,896,503117,173,0001,060,0002,113,536
6Jun 20, 2026 09:5714,250125,883,629117,252,0001,031,0002,113,536
7Jun 20, 2026 09:5714,294126,331,883117,620,0001,021,0002,113,536
8Jun 20, 2026 09:5714,297126,286,045117,636,0001,036,0002,113,536
9Jun 20, 2026 09:5714,414127,280,960118,603,0001,036,0002,113,536