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:18chereshnya123chereshnya123Score: 2,072,444Success
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:212,067,09317,166,480,89617,092,837,00064,039,0002,113,536
2Jun 5, 2026 09:212,068,77317,180,712,64817,104,531,00066,293,0002,113,536
3Jun 5, 2026 09:212,069,29917,184,540,96617,111,151,00064,036,0002,113,536
4Jun 5, 2026 09:212,070,06517,191,413,28217,114,492,00067,048,0002,113,536
5Jun 5, 2026 09:212,072,44417,211,216,92617,135,103,00066,187,0002,113,536
6Jun 5, 2026 09:212,073,43117,219,886,05817,142,421,00067,057,0002,113,536
7Jun 5, 2026 09:212,082,57017,295,134,25417,221,298,00064,033,0002,113,536
8Jun 5, 2026 09:212,088,95117,347,737,59417,274,267,00064,032,0002,113,536
9Jun 5, 2026 09:212,089,38917,351,830,58017,277,874,00064,058,0002,113,536