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 7, 2026 18:48Benn TanBenn TanScore: 8,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:488,07497,940,45566,016,0001,000,0002,404,352
2Feb 7, 2026 18:488,08194,952,06366,072,0001,001,0002,277,376
3Feb 7, 2026 18:488,08894,942,42365,127,0002,003,0002,277,376
4Feb 7, 2026 18:488,08894,710,99666,132,0001,002,0002,408,448
5Feb 7, 2026 18:488,09194,703,28166,150,0001,002,0002,277,376
6Feb 7, 2026 18:488,09389,237,35765,163,0002,005,0002,277,376
7Feb 7, 2026 18:488,09397,098,33866,172,0001,002,0002,404,352
8Feb 7, 2026 18:488,09994,274,11366,218,0001,003,0002,277,376
9Feb 7, 2026 18:488,09993,141,66465,216,0002,006,0002,392,064
10Feb 7, 2026 18:489,471107,227,23678,607,00002,273,280
11Feb 7, 2026 18:489,484110,032,09277,721,000996,0002,396,160
12Feb 7, 2026 18:489,502106,348,44677,871,000998,0002,392,064