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:15Daniel MastalerzDaniel MastalerzScore: 6,085Success
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:156,06471,018,36348,318,0002,013,0002,322,432
2Feb 19, 2026 19:156,07372,572,11446,377,0004,032,0002,306,048
3Feb 19, 2026 19:156,07374,635,85146,372,0004,032,0002,523,136
4Feb 19, 2026 19:156,08274,017,97946,444,0004,038,0002,265,088
5Feb 19, 2026 19:156,08378,367,39349,482,0001,009,0002,265,088
6Feb 19, 2026 19:156,08478,619,91348,475,0002,019,0002,367,488
7Feb 19, 2026 19:156,08577,295,82047,478,0003,030,0002,322,432
8Feb 19, 2026 19:156,10177,309,44046,588,0004,051,0002,523,136
9Feb 19, 2026 19:156,11576,768,42847,771,0002,985,0002,269,184
10Feb 19, 2026 19:156,18277,877,53248,295,0003,018,0002,265,088
11Feb 19, 2026 19:156,21481,944,82848,541,0003,033,0002,289,664
12Feb 19, 2026 19:156,21780,184,54449,616,0001,984,0002,273,280