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 27, 2026 00:43A_ShamanA_ShamanScore: 37,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:4337,499320,424,870310,241,0001,006,0002,113,536
2Jun 27, 2026 00:4337,499320,436,521310,244,0001,003,0002,113,536
3Jun 27, 2026 00:4337,500320,333,425310,247,0001,004,0002,113,536
4Jun 27, 2026 00:4337,503320,527,845310,273,0001,002,0002,113,536
5Jun 27, 2026 00:4337,506320,392,811310,302,0001,003,0002,113,536
6Jun 27, 2026 00:4337,507320,431,925310,308,0001,002,0002,113,536
7Jun 27, 2026 00:4337,510320,482,318310,330,0001,003,0002,113,536
8Jun 27, 2026 00:4337,518320,577,536310,399,0001,003,0002,113,536
9Jun 27, 2026 00:4337,518320,607,286310,403,0001,004,0002,113,536