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 23, 2026 17:06satoru.netsatoru.netScore: 66,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 17:0666,842581,318,480493,813,00060,977,0002,277,376
2Feb 23, 2026 17:0666,912582,135,155493,439,00061,929,0002,277,376
3Feb 23, 2026 17:0667,053580,314,053494,591,00061,948,0002,396,160