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 18, 2026 15:25wnwnScore: 7,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:257,34881,943,28558,989,0001,999,0002,445,312
2Feb 18, 2026 15:257,35282,267,31259,020,0002,000,0002,441,216
3Feb 18, 2026 15:257,35287,214,38159,025,0002,000,0002,453,504
4Feb 18, 2026 15:257,36583,811,09059,122,0002,004,0002,277,376
5Feb 18, 2026 15:257,38282,365,89059,265,0002,009,0002,281,472
6Feb 18, 2026 15:257,38380,508,60760,274,0001,004,0002,281,472