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 listJan 6, 2026 20:10Pavel SkripkinPavel SkripkinScore: 82,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 20:1081,015696,034,345439,622,000232,800,0002,289,664
2Jan 6, 2026 20:1081,237694,406,388439,521,000234,744,0002,338,816
3Jan 6, 2026 20:1081,275699,074,552440,725,000233,854,0002,482,176
4Jan 6, 2026 20:1081,809711,670,029447,349,000231,663,0002,473,984
5Jan 6, 2026 20:1082,145712,086,462447,869,000233,932,0002,289,664
6Jan 6, 2026 20:1082,160716,927,594446,953,000234,975,0002,527,232
7Jan 6, 2026 20:1082,217711,074,158446,609,000235,793,0002,285,568
8Jan 6, 2026 20:1082,526716,516,099446,325,000238,639,0002,469,888
9Jan 6, 2026 20:1082,740709,879,242446,834,000239,911,0002,482,176