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 13, 2026 14:57Eric CeglieEric CeglieScore: 14,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:5714,473141,624,765112,114,0008,008,0002,461,696
2Mar 13, 2026 14:5714,480148,206,517112,174,0008,012,0002,363,392
3Mar 13, 2026 14:5714,487148,659,052111,222,0009,018,0002,433,024
4Mar 13, 2026 14:5714,490143,381,152114,258,0006,013,0002,273,280
5Mar 13, 2026 14:5714,531148,332,442110,641,0009,967,0002,301,952
6Mar 13, 2026 14:5714,536144,710,308111,599,0009,048,0002,396,160
7Mar 13, 2026 14:5714,553147,310,497112,805,0007,986,0002,273,280
8Mar 13, 2026 14:5714,837150,107,887116,140,0007,008,0002,269,184
9Mar 13, 2026 14:5715,058152,416,617115,981,0008,998,0002,322,432