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 listNov 6, 2024 17:02Dan StolyarovDan StolyarovScore: 71,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 17:0271,497626,153,084539,387,00054,038,0002,457,600
2Nov 6, 2024 17:0271,525615,733,830534,694,00058,966,0002,498,560
3Nov 6, 2024 17:0271,531620,054,993533,740,00059,970,0002,281,472
4Nov 6, 2024 17:0271,537621,254,767534,778,00058,975,0002,293,760
5Nov 6, 2024 17:0271,543617,063,076532,824,00060,979,0002,281,472
6Nov 6, 2024 17:0271,591615,771,280534,184,00060,020,0002,281,472
7Nov 6, 2024 17:0271,670616,671,036533,872,00060,985,0002,265,088
8Nov 6, 2024 17:0271,683617,850,511534,976,00059,997,0002,355,200
9Nov 6, 2024 17:0271,759624,796,852530,643,00064,956,0002,289,664