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 listMay 15, 2026 14:53Victor MerckléVictor MerckléScore: 7,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 14:536,96467,059,90956,767,0001,036,0002,113,536
2May 15, 2026 14:536,96467,530,45257,804,00002,113,536
3May 15, 2026 14:536,97667,011,10356,860,0001,044,0002,113,536
4May 15, 2026 14:536,98166,935,53656,903,0001,045,0002,113,536
5May 15, 2026 14:537,02067,125,14358,271,00002,113,536
6May 15, 2026 14:537,05267,604,36157,521,0001,017,0002,113,536
7May 15, 2026 14:537,09666,932,56157,889,0001,014,0002,113,536
8May 15, 2026 14:537,14267,662,62358,242,0001,040,0002,113,536
9May 15, 2026 14:537,18567,527,95358,596,0001,040,0002,113,536