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 listMar 14, 2026 17:38Elijah KinElijah KinScore: 81,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 17:3881,380703,291,522598,520,00076,938,0002,379,776
2Mar 14, 2026 17:3881,423703,522,278606,832,00068,980,0002,383,872
3Mar 14, 2026 17:3881,478698,673,086618,242,00058,022,0002,260,992
4Mar 14, 2026 17:3881,506700,261,904620,543,00055,958,0002,375,680
5Mar 14, 2026 17:3881,525704,622,091620,686,00055,971,0002,383,872
6Mar 14, 2026 17:3881,555708,023,615627,983,00048,920,0002,260,992
7Mar 14, 2026 17:3881,564701,569,667604,983,00071,998,0002,519,040
8Mar 14, 2026 17:3881,577702,736,651623,081,00054,007,0002,260,992
9Mar 14, 2026 17:3882,277708,014,906610,907,00071,989,0002,260,992