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 03:51Andrew EpsteinAndrew EpsteinScore: 30,665Success
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 03:5230,533262,736,135251,202,0002,230,0002,121,728stderr
2Nov 3, 2026 03:5230,576263,131,838251,764,0002,022,0002,121,728stderr
3Nov 3, 2026 03:5230,640263,638,584252,305,0002,008,0002,121,728stderr
4Nov 3, 2026 03:5230,643264,114,338252,294,0002,044,0002,121,728stderr
5Nov 3, 2026 03:5230,665263,886,586252,273,0002,248,0002,121,728stderr
6Nov 3, 2026 03:5230,679263,833,578252,613,0002,030,0002,121,728stderr
7Nov 3, 2026 03:5230,724264,756,115253,006,0002,009,0002,121,728stderr
8Nov 3, 2026 03:5230,806265,326,854253,677,0002,021,0002,121,728stderr
9Nov 3, 2026 03:5230,856265,867,696254,096,0002,012,0002,121,728stderr