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 5, 2026 09:12chereshnya123chereshnya123Score: 87,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 09:1386,942730,737,588662,733,00058,888,0002,113,536
2Jun 5, 2026 09:1387,012731,332,453663,770,00058,432,0002,113,536
3Jun 5, 2026 09:1387,038731,544,140662,916,00059,506,0002,113,536
4Jun 5, 2026 09:1387,099731,932,707664,211,00058,711,0002,113,536
5Jun 5, 2026 09:1387,145732,421,426664,140,00059,171,0002,113,536
6Jun 5, 2026 09:1387,157732,623,734663,233,00060,178,0002,113,536
7Jun 5, 2026 09:1387,217733,023,216663,941,00059,966,0002,113,536
8Jun 5, 2026 09:1387,224733,070,133663,427,00060,537,0002,113,536
9Jun 5, 2026 09:1387,226733,027,311664,127,00059,853,0002,113,536