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 21, 2026 13:39Daniel MastalerzDaniel MastalerzScore: 5,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 13:395,74776,472,01644,658,0003,044,0002,326,528
2Feb 21, 2026 13:395,75471,870,09844,771,0002,984,0002,326,528
3Feb 21, 2026 13:395,76171,697,86343,833,0003,984,0002,306,048
4Feb 21, 2026 13:395,82672,438,25645,334,0003,022,0002,301,952
5Feb 21, 2026 13:395,82672,860,95946,344,0002,014,0002,281,472
6Feb 21, 2026 13:395,84976,632,69446,526,0002,022,0002,289,664