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 listApr 1, 2026 01:01zielajzielajScore: 3,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 01:013,44558,294,25027,569,0001,021,0002,519,040
2Apr 1, 2026 01:013,44758,405,58027,585,0001,021,0002,523,136
3Apr 1, 2026 01:013,44954,322,48127,607,0001,022,0002,510,848
4Apr 1, 2026 01:013,45051,844,96426,594,0002,045,0002,519,040
5Apr 1, 2026 01:013,45755,524,65827,669,0001,024,0002,437,120
6Apr 1, 2026 01:013,47453,727,68027,843,000994,0002,519,040