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 listAug 13, 2025 22:44Andrija ZarićAndrija ZarićScore: 60,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 22:4459,920519,989,312497,333,00002,289,664
2Aug 13, 2025 22:4459,949524,802,873495,576,0001,998,0002,355,200
3Aug 13, 2025 22:4459,977522,721,950496,808,000999,0002,465,792
4Aug 13, 2025 22:4459,983526,628,225496,856,000999,0002,367,488
5Aug 13, 2025 22:4460,020525,021,873498,163,00002,355,200
6Aug 13, 2025 22:4460,037524,796,507498,303,00002,289,664
7Aug 13, 2025 22:4460,050529,807,905498,413,00002,289,664
8Aug 13, 2025 22:4460,070524,953,759497,584,000999,0002,289,664
9Aug 13, 2025 22:4460,075526,554,501497,625,000999,0002,371,584