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 10:57Andrew EpsteinAndrew EpsteinScore: 103,928Success
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 10:58103,652870,352,422856,981,0003,338,0002,121,728stderr
2Nov 3, 2026 10:58103,681870,423,144858,439,0002,121,0002,121,728stderr
3Nov 3, 2026 10:58103,719870,559,912858,843,0002,032,0002,121,728stderr
4Nov 3, 2026 10:58103,783871,172,463859,383,0002,017,0002,121,728stderr
5Nov 3, 2026 10:58103,928871,840,479860,546,0002,062,0002,121,728stderr
6Nov 3, 2026 10:58103,978872,503,670859,955,0003,068,0002,121,728stderr
7Nov 3, 2026 10:58104,094873,897,832860,766,0003,221,0002,121,728stderr
8Nov 3, 2026 10:58104,128873,617,590862,232,0002,034,0002,121,728stderr
9Nov 3, 2026 10:58104,164874,300,604862,550,0002,019,0002,121,728stderr