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 listFeb 10, 2026 22:35Daniel MastalerzDaniel MastalerzScore: 8,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 22:358,52698,639,54669,766,000996,0002,277,376
2Feb 10, 2026 22:358,53198,035,09666,817,0003,989,0002,265,088
3Feb 10, 2026 22:358,54496,689,71568,922,0001,997,0002,326,528
4Feb 10, 2026 22:358,68994,701,77668,112,0004,006,0002,322,432
5Feb 10, 2026 22:358,70195,976,23869,211,0003,009,0002,269,184
6Feb 10, 2026 22:358,721101,219,60870,374,0002,010,0002,322,432