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 15:30Dominique GarmierDominique GarmierScore: 10,394Success
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 15:3010,315117,737,18884,608,0001,007,0002,273,280
2Mar 13, 2026 15:3010,349117,242,77784,900,000998,0002,269,184
3Mar 13, 2026 15:3010,388110,520,35284,216,0002,005,0002,273,280
4Mar 13, 2026 15:3010,391109,796,80584,240,0002,005,0002,260,992
5Mar 13, 2026 15:3010,394107,466,17685,270,0001,003,0002,269,184
6Mar 13, 2026 15:3010,502112,716,48087,169,00002,273,280
7Mar 13, 2026 15:3010,563113,580,41185,684,0001,992,0002,269,184
8Mar 13, 2026 15:3010,594114,352,83785,931,0001,998,0002,269,184
9Mar 13, 2026 15:3011,093115,242,52190,069,0002,001,0002,269,184