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 11, 2026 21:17olliecrowolliecrowScore: 6,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 21:175,84068,778,31746,457,0002,019,0002,269,184
2Feb 11, 2026 21:175,86273,430,11445,611,0003,040,0002,420,736
3Feb 11, 2026 21:175,90379,571,39446,998,0001,999,0002,375,680
4Feb 11, 2026 21:176,20977,637,76249,516,0002,021,0002,527,232
5Feb 11, 2026 21:176,43780,209,63551,408,0002,016,0002,420,736
6Feb 11, 2026 21:176,53186,113,17852,202,0002,007,0002,359,296