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 listNov 3, 2026 13:02Andrew EpsteinAndrew EpsteinScore: 56,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 13:0956,114474,998,582463,708,0002,044,0002,121,728stderr
2Nov 3, 2026 13:0956,246476,269,132464,837,0002,007,0002,121,728stderr
3Nov 3, 2026 13:0956,280476,438,323465,118,0002,011,0002,121,728stderr
4Nov 3, 2026 13:0956,289476,525,546464,136,0003,067,0002,121,728stderr
5Nov 3, 2026 13:0956,294476,472,137465,226,0002,015,0002,125,824stderr
6Nov 3, 2026 13:0956,329476,850,229465,516,0002,022,0002,125,824stderr
7Nov 3, 2026 13:0956,392477,402,241466,039,0002,015,0002,121,728stderr
8Nov 3, 2026 13:0956,430478,137,038466,371,0002,005,0002,121,728stderr
9Nov 3, 2026 13:0956,443477,771,897466,474,0002,007,0002,121,728stderr