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 19, 2026 19:09Daniel MastalerzDaniel MastalerzScore: 7,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:097,13978,413,67156,238,0003,012,0002,269,184
2Feb 19, 2026 19:097,14784,620,61555,295,0004,021,0002,523,136
3Feb 19, 2026 19:097,14786,062,45655,300,0004,021,0002,269,184
4Feb 19, 2026 19:097,26781,453,04058,310,0002,010,0002,310,144
5Feb 19, 2026 19:097,27886,493,47756,382,0004,027,0002,306,048
6Feb 19, 2026 19:097,27984,103,69659,411,0001,006,0002,318,336