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:21wnwnScore: 4,248Success
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:214,21058,084,99732,948,0001,996,0002,277,376
2Apr 12, 2026 12:214,21959,505,65933,014,0002,000,0002,277,376
3Apr 12, 2026 12:214,22463,695,15533,053,0002,003,0002,494,464
4Apr 12, 2026 12:214,23262,660,34133,116,0002,007,0002,490,368
5Apr 12, 2026 12:214,24858,765,45733,247,0002,014,0002,498,560
6Apr 12, 2026 12:214,25460,599,04433,288,0002,017,0002,498,560
7Apr 12, 2026 12:214,25757,800,28133,315,0002,019,0002,277,376
8Apr 12, 2026 12:214,27259,409,78634,443,0001,013,0002,494,464
9Apr 12, 2026 12:214,31863,640,19733,849,0001,991,0002,494,464