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 listSep 4, 2025 20:01Adam FolwarcznyAdam FolwarcznyScore: 7,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2025 20:017,36582,175,45743,089,00018,037,0002,396,160
2Sep 4, 2025 20:017,39684,573,59744,281,00017,108,0002,371,584
3Sep 4, 2025 20:017,40980,307,68946,376,00015,122,0002,281,472
4Sep 4, 2025 20:017,41689,453,34345,406,00016,144,0002,273,280
5Sep 4, 2025 20:017,44486,671,65744,842,00016,940,0002,281,472
6Sep 4, 2025 20:017,48490,386,69248,091,00014,026,0002,326,528