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 8, 2026 08:55chereshnya123chereshnya123Score: 62,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 08:5562,661529,213,881462,621,00057,472,0002,113,536
2Jun 8, 2026 08:5562,697531,981,578462,881,00057,511,0002,113,536
3Jun 8, 2026 08:5562,702529,455,734462,907,00057,522,0002,113,536
4Jun 8, 2026 08:5562,746529,842,713462,752,00058,048,0002,113,536
5Jun 8, 2026 08:5562,777530,169,328462,892,00058,160,0002,113,536
6Jun 8, 2026 08:5562,800530,405,280462,768,00058,480,0002,113,536
7Jun 8, 2026 08:5562,803530,418,166462,706,00058,559,0002,113,536
8Jun 8, 2026 08:5562,935531,498,325462,878,00059,484,0002,113,536
9Jun 8, 2026 08:5563,052532,390,876463,006,00060,329,0002,113,536