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 listApr 12, 2026 12:04wnwnScore: 4,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 12:044,20161,133,67632,875,0001,992,0002,494,464
2Apr 12, 2026 11:594,21164,477,18632,953,0001,997,0002,498,560
3Apr 12, 2026 12:054,21857,951,71633,008,0002,000,0002,506,752
4Apr 12, 2026 11:594,22458,974,87833,058,0002,003,0002,498,560
5Apr 12, 2026 11:594,22559,101,41433,066,0002,004,0002,277,376
6Apr 12, 2026 12:054,23056,130,41933,099,0002,006,0002,277,376
7Apr 12, 2026 12:044,23164,131,48533,114,0002,006,0002,277,376
8Apr 12, 2026 12:044,23261,692,68033,116,0002,007,0002,535,424
9Apr 12, 2026 12:054,27062,442,32934,433,0001,012,0002,277,376