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 12, 2026 13:52Mikołaj UzarskiMikołaj UzarskiScore: 5,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:525,08462,686,08640,191,0002,009,0002,281,472
2Mar 12, 2026 13:525,09368,610,03841,265,0001,006,0002,510,848
3Mar 12, 2026 13:525,09870,216,88940,299,0002,014,0002,289,664
4Mar 12, 2026 13:525,10265,004,10540,327,0002,016,0002,289,664
5Mar 12, 2026 13:525,10768,563,71041,377,0001,009,0002,289,664
6Mar 12, 2026 13:525,11369,430,85240,416,0002,020,0002,289,664
7Mar 12, 2026 13:525,11567,793,22440,432,0002,021,0002,281,472
8Mar 12, 2026 13:525,13268,638,92141,584,0001,014,0002,281,472
9Mar 12, 2026 13:525,15470,980,23641,785,000994,0002,506,752