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 listMay 7, 2026 07:42ふぃぼふぃぼScore: 2,040,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 07:442,039,55316,948,577,28016,860,246,00068,050,0002,322,432
2May 7, 2026 07:442,039,61516,949,392,98316,864,756,00064,054,0002,322,432
3May 7, 2026 07:442,039,78716,948,361,36816,860,167,00070,073,0002,322,432
4May 7, 2026 07:442,039,93516,948,820,81616,867,427,00064,036,0002,318,336
5May 7, 2026 07:442,040,17816,950,316,94916,867,259,00066,219,0002,318,336
6May 7, 2026 07:442,040,62416,954,038,91916,872,034,00065,147,0002,510,848
7May 7, 2026 07:442,042,23516,967,823,03216,886,515,00064,042,0002,322,432
8May 7, 2026 07:442,060,73317,122,380,57517,039,838,00064,246,0002,506,752
9May 7, 2026 07:442,076,52017,255,203,67917,171,075,00064,043,0002,322,432